Infinite Partition Regular Matrices: Solutions in Central Sets

A finite or infinite matrix A is image partition regular provided that whenever N is finitely colored, there must be some ~x with entries from N such that all entries of A~x are in the same color class. In contrast to the finite case, infinite image partition regular matrices seem very hard to analyze: they do not enjoy the closure and consistency properties of the finite case, and it is difficult to construct new ones from old. In this paper we introduce the stronger notion of central image partition regularity , meaning that A must have images in every central subset of N. We describe some classes of centrally image partition regular matrices and investigate the extent to which they are better behaved than ordinary image partition regular matrices. It turns out that the centrally image partition regular matrices are closed under some natural operations, and this allows us to give new examples of image partition regular matrices. In particular, we are able to solve a vexing open problem by showing that whenever N is finitely colored, there must exist injective sequences 〈xn〉n=0 and 〈zn〉n=0 in N with all sums of the forms xn + xm and zn + 2zm with n < m in the same color class. This is the first example of an image partition regular system whose regularity is not guaranteed by the Milliken-Taylor Theorem, or variants thereof.